Essays on Auction Mechanisms and Resource Allocation in Keyword Advertising
نویسندگان
چکیده
iv
منابع مشابه
RESOURCE PACKAGING IN KEYWORD AUCTIONS Web - based Information Systems and Applications
Motivated by the enormous growth of keyword advertising, this paper studies how to package certain resources into shares for auctioning to maximize the auctioneer's expected revenue. We study such a problem in a unit-price auction setting where each bidder has private valuation for the shares, and the allocation of shares is determined by the rank-order of bidders' willingness-topay for per-uni...
متن کاملDevelopment of a Genetic Algorithm for Advertising Time Allocation Problems
Commercial advertising is the main source of income for TV channels and allocation of advertising time slots for maximizing broadcasting revenues is the major problem faced by TV channel planners. In this paper, the problem of scheduling advertisements on prime-time of a TV channel is considered. The problem is formulated as a multi-unit combinatorial auction based mathematical model. This is a...
متن کاملKeyword Auctions, Unit-Price Contracts, and the Role of Commitment
Motivated by the enormous growth of keyword advertising, this paper explores the design of performance-based unitprice contract auctions, in which bidders bid their unit prices and the winner is chosen based on both their bids and performance levels. The previous literature on unit-price contract auctions usually considers a static case where bidders’ performance levels are fixed. This paper st...
متن کاملKeyword Auctions as Weighted Unit-Price Auctions
In recent years, unit-price auctions in which bidders bid their willingness-to-pay for per-unit realized outcome have been adopted by major keyword advertising providers such as Yahoo!, Google, and MSN, in selling keyword advertising slots on web sites. The majority of keyword auctions are pay-per-click auctions in which advertisers specify their willingness-to-pay per click, and pay by the cli...
متن کاملBid optimization in online advertisement auctions
We consider the problem of online keyword advertising auctions among multiple bidders with limited budgets, and propose a bidding heuristic to optimize the utility for bidders by equalizing the return-on-investment for each bidder across all keywords. We show that natural auction mechanisms combined with this heuristic can experience chaotic cycling (as is the case with many current advertiseme...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008